Powerfree sums of proper divisors
نویسندگان
چکیده
Let $s(n):= \sum _{d\,|\, n,\,d \lt n} d$ denote the sum of proper divisors $n$. It is natural to conjecture that for each integer $k\ge 2$, equivalence \[ \text {$n$ $k$th powerfree} \iff {$s(n)$ \] holds almost al
منابع مشابه
Palindromic Sums of Proper Divisors
Fix an integer g 2. A natural number n is called a palindrome in base g if its base g expansion reads the same forwards and backwards. Let s(n) = P d|n, d<n d be the sum-of-proper-divisors function. We show that for almost all (that is, asymptotically 100% of) natural numbers n, s(n) is not a palindrome in base g. We also show how to reach the same conclusion for several other commonly occurrin...
متن کاملDivisors of Bernoulli sums
Let B n = b 1 +. .. + b n , n ≥ 1 where b 1 , b 2 ,. .. are independent Bernoulli random variables. In relation with the divisor problem, we evaluate the almost sure asymptotic order of the sums N n=1 d θ,D (B n), where d θ,D (B n) = #{d ∈ D, d ≤ n θ : d|B n } and D is a sequence of positive integers.
متن کاملOn Divisors of Sums of Integers, Iii
1. Let P{ή) and p(n) denote the greatest and smallest prime factor of n, respectively. Recently in several papers, Balog, Erdόs, Maier, Sarkozy, and Stewart have studied problems of the following type: if A\,...,Ak are "dense" sets of positive integers, then what can be said about the arithmetical properties of the sums a\ H h % with a,\ G A\,...,ak G Akl In particular, Balog and Sarkόzy proved...
متن کاملSums of Divisors, Perfect Numbers and Factoring
Let N be a positive integer, and let denote the sum of the divisors of N = 1+2+3+6 = 12). We show computing is equivalent to factoring N in the following sense: there is a random polynomial time algorithm that, given N),produces the prime factorization of N, and N) can be computed in polynomial time given the factorization of N. We show that the same result holds for the sum of the kth powers o...
متن کاملConvolution Sums of Some Functions on Divisors
One of the main goals in this paper is to establish convolution sums of functions for the divisor sums σ̃s(n) = ∑ d|n(−1)d and σ̂s(n) = ∑ d|n(−1) n d d, for certain s, which were first defined by Glaisher. We first introduce three functions P(q), E(q), and Q(q) related to σ̃(n), σ̂(n), and σ̃3(n), respectively, and then we evaluate them in terms of two parameters x and z in Ramanujan’s theory of ell...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 2022
ISSN: ['0010-1354', '1730-6302']
DOI: https://doi.org/10.4064/cm8616-10-2021